Reconstruction of hv-Convex Binary Images with Diagonal and Anti-Diagonal Projections using Genetic Algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of hv-convex binary matrices from their absorbed projections

The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-hard if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by =(1+ √ 5)=2. Also a reconstruction algorithm is given to determine th...

متن کامل

Decision Trees in Binary Tomography for Supporting the Reconstruction of hv-Convex Connected Images

In binary tomography, several algorithms are known for reconstructing binary images having some geometrical properties from their projections. In order to choose the appropriate reconstruction algorithm it is necessary to have a priori information of the image to be reconstructed. In this way we can improve the speed and reduce the ambiguity of the reconstruction. Our work is concerned with the...

متن کامل

The Diagonal Reduction Algorithm Using Fast Givens

Recently, a new lattice basis reduction notion, called diagonal reduction, was proposed for lattice-reduction-aided detection (LRAD) of multiinput multioutput (MIMO) systems. In this paper, we improve the efficiency of the diagonal reduction algorithm by employing the fast Givens transformations. The technique of the fast Givens is applicable to a family of LLL-type lattice reduction methods to...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Reconstructing hv-Convex Polyominoes from Orthogonal Projections

Tomography is the area of reconstructing objects from projections. In discrete tomography an object T we wish to reconstruct may be a set of cells of a multidimensional grid. We perform measurements of T , each one involving a projection that determines the number of cells in T on all lines parallel to the projection’s direction. Given a finite number of such measurements, we wish to reconstruc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2016

ISSN: 0974-5645,0974-6846

DOI: 10.17485/ijst/2016/v9i45/104103